Query processing in sensor networks.
Hardware for sensor nodes that combine physical sensors, actuators, embedded processors, and communication components has advanced significantly over the last decade, and made the large-scale deployment of such sensors a reality. Applications range from monitoring applications such as inventory maintenance over health care to military applications.
Privacy%2DAware Folksonomies.

Finding misplaced items in retail by clustering RFID data.

Collaborative data privacy for the web.

Energy%2Defficient processing of spatio%2Dtemporal queries in wireless sensor networks.

Processing continuous join queries in sensor networks a filtering approach.

Deriving Spatio%2Dtemporal Query Results in Sensor Networks.

Query Dissemination in Sensor Networks %2D Predicting Reachability and Energy Consumption.

Fault%2Dtolerant query processing in structured P2P%2Dsystems.%2
The P-Grid approach enables distributed search and replication.
Fault%2Dtolerant query processing in structured P2P%2Dsystems.%2
The P-Grid approach enables distributed search and replication.
Software als Institution und ihre Gestaltbarkeit.

Towards collaborative web%2Dbased impact assessment.

Towards materialized view selection for distributed databases.

Towards materialized view selection for distributed databases.

Towards Efficient Processing of General%2DPurpose Joins in Sensor Networks.
Abstract — Join processing in wireless sensor networks is difficult: As the tuples can be arbitrarily distributed within the network, matching pairs of tuples is communication intensive and costly in terms of energy. Current solutions only work well with specific placements of the nodes and/or make restrictive assumptions. In this paper, we present SENS-Join, an efficient general-purpose join method for sensor networks. To obtain efficiency, SENS-Join does not ship tuples that do not join, based on a filtering step. Our main contribution is the design of this filtering step which is highly efficient in order not to exhaust the potential savings. We demonstrate the performance of SENS-Join experimentally: The overall energy consumption can be reduced by more than 80%, as compared to the state-of-the-art approach. The per node energy consumption of the most loaded nodes can be reduced by more than an order of magnitude. I.
Understanding User Preferences and Awareness Privacy Mechanisms in Location%2DBased Services.

A Wavelet Transform for Efficient Consolidation of Sensor Relations with Quality Guarantees.
Answering queries with a low selectivity in wireless sensor networks is a challenging problem. A simple tree-based data collection is communication-intensive and costly in terms of energy. Prior work has addressed the problem by approximating query results based on models of sensor readings. This cuts communication effort if the accuracy requirements are loose, e.g., if the temperature is required within ±0.5 ◦ C. For more accuracy, the models need frequent updates, and the communication costs quickly increase. In addition, sophisticated models incur substantial training costs. We propose a query-processing scheme that efficiently consolidates sensor data based on wavelet synopses. The difficulty is that the synopsis has to be constructed incrementally during data collection to ensure efficiency. Our core contribution is to show how to distribute the construction of wavelet synopses in sensor networks. In addition, our approach provides strict error guarantees. We evaluate our distributed wavelet compaction on real-world and on synthetic sensor data. Our solution reduces communication costs by more than a factor of five compared to state-of-the-art approaches. Further, our error guarantees for which efficient data consolidation is possible are better than theirs by more than an order of magnitude. 1.
Query Dissemination with Predictable Reachability and Energy Usage in Sensor Networks.
Abstract. Energy-efficient query dissemination plays an important role for the lifetime of sensor networks. In this work, we consider probabilistic flooding for query dissemination and develop an analytical framework which enables the base station to predict the energy consumed and the nodes reached according to the rebroadcast probability. Furthermore, we devise a topology discovery protocol that collects the structural information required for the framework. Our analysis shows that the energy savings exceed the energy spent to obtain the required information after a small number of query disseminations in realistic settings. We verified our results both with simulations and experiments using the SUN Spot nodes. 1
Collaborative Search and User Privacy How Can They Be Reconciled%3F.

Towards Compact Operator Trees for Query Indexing.

Tagmark reliable estimations of RFID tags for business processes.

Discovering the Scope of Privacy Needs in Collaborative Search.

PRIMO %2D Towards Privacy Aware Image Sharing.

Trust Mechanisms and Reputation Systems.
The Internet has evolved greatly from its original incarnation. For instance, the vast majority of current Internet usage is data retrieval and service access, whereas the architecture was designed around host-to-host applications such as telnet and ftp. Moreover, the original Internet was a purely transparent carrier of packets, but now the various network stakeholders use middleboxes to improve security and accelerate applications. To adapt to these changes, we propose the Data-Oriented Network Architecture (DONA), which involves a clean-slate redesign of Internet naming and name resolution. Categories and Subject Descriptors C.2.5 [Computer-Communication Networks]: Local and Wide-
Trust Mechanisms and Reputation Systems.
The Internet has evolved greatly from its original incarnation. For instance, the vast majority of current Internet usage is data retrieval and service access, whereas the architecture was designed around host-to-host applications such as telnet and ftp. Moreover, the original Internet was a purely transparent carrier of packets, but now the various network stakeholders use middleboxes to improve security and accelerate applications. To adapt to these changes, we propose the Data-Oriented Network Architecture (DONA), which involves a clean-slate redesign of Internet naming and name resolution. Categories and Subject Descriptors C.2.5 [Computer-Communication Networks]: Local and Wide-
Free riding%2Daware forwarding in Content%2DAddressable Networks.

Towards Truthful Feedback in P2P Data Structures.

Verteilte Anfrageverarbeitung in DHT%2Dbasierten P2P%2DSystemen.

Malicious Behaviour in Content%2DAddressable Peer%2Dto%2DPeer Networks.

Efficient Evaluation of Nearest%2DNeighbor Queries in Content%2DAddressable Networks.

Efficient Evaluation of Nearest%2DNeighbor Queries in Content%2DAddressable Networks.

Best Effort Query Processing in DHT%2Dbased P2P Systems.

Piggyback Meta%2DData Propagation in Distributed Hash Tables.
Abstract: Distributed Hashtables (DHT) are intended to provide Internet-scale data management. By following the peer-to-peer paradigm, DHT consist of independent peers and operate without central coordinators. Consequentially, global knowledge is not available and any information have to be exchanged by local interactions between the peers. Beneath data management operations, a lot of meta-data have to be exchanged between the nodes, e.g., status updates, feedback for reputation management or application-specific information. Because of the large scale of the DHT, it would be expensive to disseminate meta-data by peculiar messages. In this article we investigate in a lazy dissemination protocol that piggybacks attachments to messages the peers send out anyhow. We present a software engineering approach based on mixin layers and aspect-oriented programming to cope with the extremely differing application-specific requirements. The applicability of our protocol is confirmed by means of experiments with a CAN implementation. 1
FairNet %2D How to Counter Free Riding in Peer%2Dto%2DPeer Data Structures.
Abstract. Content-Addressable Networks (CAN) manage huge sets of (key, value)-pairs and cope with very high workloads. They follow the peer-to-peer paradigm: They consist of nodes that are autonomous. This means that peers may be uncooperative, i.e., not carrying out their share of the work while trying to benefit from the network. This article deals with this kind of adverse behavior in CAN, e.g., not answering queries and not forwarding messages. It is challenging to design a forwarding protocol for large CAN of more than 100,000 nodes that bypasses and excludes uncooperative nodes. We have designed such a protocol, with the following characteristics: It establishes logical networks of peers within the CAN. Nodes give positive feedback on peers that have performed useful work. Feedback is distributed in a swarm-like fashion and expires after a certain period of time. In extreme situations, the CAN asks nodes to perform a proof of work. Results of experiments with 100,000 peers are positive: In particular, cooperative peers fare significantly better than uncooperative ones. 1
How to Run Experiments with Large Peer%2Dto%2DPeer Data Structure.


Effizientes Routing in verteilten skalierbaren Datenstrukturen.


Konzeption eines erweiterbaren Speichermanagers f%FCr leichtgewichtige

